Optimal Extension Fields for Fast Arithmetic in Public - Keyalgorithmsa
نویسنده
چکیده
This report introduces a new class of Galois eld used to achieve fast nite eld arithmetic which we call an Optimal Extension Field (OEF). This approach is well suited for implementation of public-key cryptosystems based on elliptic and hyperelliptic curves on RISC workstations. We de ne OEFs and describe methods for their construction. In addition, we demonstrate that use of an OEF yields the fastest reported software implementation of an elliptic curve-based cryptosystem. i
منابع مشابه
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
This contribution introduces a class of Galois eld used to achieve fast nite eld arithmetic which we call an Optimal Extension Field OEF This approach is well suited for implementation of public key cryptosystems based on elliptic and hyperelliptic curves Whereas previous reported optimizations focus on nite elds of the form GF p and GF m an OEF is the class of elds GF p for p a prime of specia...
متن کاملFast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents
This contribution describes a new class of arithmetic architectures for Galois fields GF (2k). The main applications of the architecture are public-key systems which are based on the discrete logarithm problem for elliptic curves. The architectures use a representation of the field GF (2k) as GF ((2n)m), where k = n · m. The approach explores bit parallel arithmetic in the subfield GF (2n), and...
متن کاملECCPERT Elliptic Curve Cryptosystem Development and Design
ECCpert is an implementation of an Elliptic Curve Cryptosystem which is based over a finite field from special class called Optimal Extension Fields (OEFs). OEFs utilise the fast integer arithmetic available on modern processors to produce very efficient results. Thus, they do not need to resort to multiprecision operations or arithmetic using polynomials of large degree. This paper discusses t...
متن کاملQuasi-optimal Arithmetic for Quaternion Polynomials
Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform, they for instance multiply two polynomials of degree up to n or multi-evaluate one at n points simultaneously within quasilinear time O(n · polylog n). An extension to (and in fact the mere definition of) po...
متن کاملOn Efficient Pairings on Elliptic Curves over Extension Fields
In implementation of elliptic curve cryptography, three kinds of finite fields have been widely studied, i.e. prime field, binary field and optimal extension field. In pairing-based cryptography, however, pairingfriendly curves are usually chosen among ordinary curves over prime fields and supersingular curves over extension fields with small characteristics. In this paper, we study pairings on...
متن کامل